<HTML><HEAD><TITLE>cs_create(-CS, ++Options)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(tentative)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>cs_create(-CS, ++Options)</H1>
Create an empty constraint set
<DL>
<DT><EM>CS</EM></DT>
<DD>Constraint set (output)
</DD>
<DT><EM>Options</EM></DT>
<DD>List of options
</DD>
</DL>
<H2>Description</H2>

	Create an empty constraint set. No options are currently supported.
	A constraint set is an abstract data structure which should only
	be accessed through the cs_xxx group of predicates. Its purpose
	is to group constraints together and organise access to these
	constraints based on their violatedness counts.
    
<H3>Modes and Determinism</H3><UL>
<LI>cs_create(-, ++) is det
</UL>
<H2>Examples</H2>
<PRE>
    ?- cs_create(CS, []).
    CS = constraint_set(Violations{0 -&gt; 0}, [])
    Yes (0.00s cpu)
    </PRE>
<H2>See Also</H2>
<A HREF="../../lib/tentative/NT-2.html">:~ / 2</A>, <A HREF="../../lib/tentative/cs_clear_all-1.html">cs_clear_all / 1</A>, <A HREF="../../lib/tentative/cs_clear_satisfied-1.html">cs_clear_satisfied / 1</A>, <A HREF="../../lib/tentative/cs_violations-2.html">cs_violations / 2</A>, <A HREF="../../lib/tentative/cs_current_violations-2.html">cs_current_violations / 2</A>, <A HREF="../../lib/tentative/cs_random_worst-2.html">cs_random_worst / 2</A>, <A HREF="../../lib/tentative/cs_all_worst-2.html">cs_all_worst / 2</A>, <A HREF="../../lib/tentative/cs_all_violated-2.html">cs_all_violated / 2</A>, <A HREF="../../lib/tentative/cs_random_violated-2.html">cs_random_violated / 2</A>, <A HREF="../../lib/tentative/cs_all-2.html">cs_all / 2</A>
</BODY></HTML>
